Normal Vector of a Random Hyperplane

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Normal Vector of a Random Hyperplane

Let v1, . . . ,vn−1 be n − 1 independent vectors in R (or C). We study x, the unit normal vector of the hyperplane spanned by the vi. Our main finding is that x resembles a random vector chosen uniformly from the unit sphere, under some randomness assumption on the vi. Our result has applications in random matrix theory. Consider an n×n random matrix with iid entries. We first prove an exponent...

متن کامل

Random Hyperplane Search Trees

Abstract. A hyperplane search tree is a binary tree used to store a set S of n d-dimensional data points. In a random hyperplane search tree for S, the root represents a hyperplane defined by d data points drawn uniformly at random from S. The remaining data points are split by the hyperplane, and the definition is used recursively on each subset. We assume that the data are points in general p...

متن کامل

Random Walk and Hyperplane Arrangements

Let C be the set of chambers of a real hyperplane arrangement. We study a random walk on C introduced by Bidigare, Hanlon, and Rockmore. This includes various shuuing schemes used in computer science, biology, and card games. It also includes random walks on zonotopes and zonotopal tilings. We nd the stationary distributions of these Markov chains, give good bounds on the rate of convergence to...

متن کامل

Functions of random walks on hyperplane arrangements

Article history: Received 14 December 2009 Accepted 5 February 2010 Available online 24 March 2010 MSC: primary 60J10 secondary 52C35

متن کامل

Random hyperplane search trees in high dimensions

Given a set S of n ≥ d points in general position in Rd, a random hyperplane split is obtained by sampling d points uniformly at random without replacement from S and splitting based on their affine hull. A random hyperplane search tree is a binary space partition tree obtained by recursive application of random hyperplane splits. We investigate the structural distributions of such random trees...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2016

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rnw273